Semi-perfect andF-semi-perfect modules

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Semi-perfect 1-Factorizations

The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K2n in which any two 1-factors induce a Hamiltonian cycle. This conjecture is one of the prominent open problems in graph theory. Apart from its theoretical significance it has a number of applications, particularly in designing topologies for wireless communication. Recently, ...

متن کامل

Semi-perfect Category-graded Algebras

We introduce the notion of algebras graded over a small category and give a criterion for such algebras to be semi-perfect. AMS Subject Classification (2000): 18E15,16W50.

متن کامل

Aperiodic and semi-periodic perfect maps

Paterson [l] has recently shown that the trivial necessary conditions are sufficient for the existence of a (binary) perfect map. These periodic structures can be transformed very simply into corresponding aperiodic and semi-periodic perfect maps. However, aperiodic and semi-periodic perfect maps can exist for parameter sets for which the corresponding periodic perfect maps cannot. In this pape...

متن کامل

A semi-induced subgraph characterization of upper domination perfect graphs

Let β(G) and Γ(G) be the independence number and the upper domination number of a graphG, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classes of graphs as strongly perfect graphs, absorbantly perfect graphs, and circular arc graphs. In this article, we present a characterization of Γ-per...

متن کامل

Semi-Universal Convolutional Compressed Sensing Using (Nearly) Perfect Sequences

In this paper, a new class of circulant matrices for compressed sensing are proposed by introducing nearly perfect sequences into the random convolution framework. Measurements are obtained by circularly convolving the signal not with a random sequence, but with a well-designed deterministic sequence, followed by random subsampling. Both uniform recovery and non-uniform recovery of sparse signa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences

سال: 1985

ISSN: 0161-1712,1687-0425

DOI: 10.1155/s0161171285000588